Doubly Residual Neural Decoder: Towards Low-Complexity High-Performance Channel Decoding
نویسندگان
چکیده
Recently deep neural networks have been successfully applied in channel coding to improve the decoding performance. However, state-of-the-art decoders cannot achieve high performance and low complexity simultaneously. To overcome this challenge, paper we propose doubly residual (DRN) decoder. By integrating both input learning design of decoder, DRN enables significant improvement while maintaining complexity. Extensive experiment results show that on different types codes, our decoder consistently outperform terms performance, model sizes computational cost.
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملChannel Encoder Caching Decoder Channel Decoder Encoding Decoding
The emerging technology of Internet of Things (IoT) has raised fundamental challenges in the design of practical and high performance data transmission and storage systems. Current network architectures and communication schemes are incapable of supporting the massive data, high rate, low latency, and large number of users that are envisioned in the applications of IoT. I am interested in novel...
متن کاملTowards Low-Complexity Linear-Programming Decoding
We consider linear-programming (LP) decoding of low-density parity-check (LDPC) codes. While it is clear that one can use any general-purpose LP solver to solve the LP that appears in the decoding problem, we argue in this paper that the LP at hand is equipped with a lot of structure that one should take advantage of. Towards this goal, we study the dual LP and show how coordinate-ascent method...
متن کاملHigh-performance, low-complexity decoding of generalized low-density parity-check codes
A class of pseudo-random compound error-correcting codes, called Generalized Low-Density (GLD) Parity-Check codes, has been proposed recently. As a generalization of Gallager’s Low-Density ParityCheck (LDPC) codes, GLD codes are also asymptotically good in the sense of minimum distance criterion and can be effectively decoded based on iterative soft-input soft-output (SISO) decoding of individu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v35i10.17040